Extraconnectivity of hypercubes (II)

نویسندگان

  • Weihua Yang
  • Jixiang Meng
چکیده

The g-extraconnectivity κg(G) of a simple connected graph G is the minimum cardinality of a subset of V (G), if any, whose deletion disconnects G in such a way that every remaining component has at least g vertices. In this paper, we determine κg(Qn) for n+2 ≤ g ≤ 2n, n ≥ 4, where Qn denotes the n-dimensional hypercube.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Extraconnectivity of graphs with large minimum degree and girth

The extraconnectivity ~,-(n) of a simple connected graph G is a kind of conditional connectivity which is the minimum cardinality of a set of vertices, if any, whose deletion disconnects G in such a way that every remaining component has more than n vertices. The usual connectivity and superconnectivity of G correspond to K(0) and 1<(1), respectively. This paper gives sufficient conditions, rel...

متن کامل

Fault-tolerant analysis of a class of networks

In this paper, we explore the 2-extraconnectivity of a special class of graphs G(G0,G1;M) proposed by Chen et al. [Y.-C. Chen, J.J.M. Tan, L.-H. Hsu, S.-S. Kao, Super-connectivity and super edge-connectivity for some interconnection networks, Applied Mathematics and Computation 140 (2003) 245–254]. As applications of the results, we obtain that the 2-extraconnectivities of several well-known in...

متن کامل

A General Construction for Space-filling Latin Hypercubes

Abstract: We propose a general method for constructing Latin hypercubes of flexible run sizes for computer experiments. The method makes use of arrays with a special structure and Latin hypercubes. By using different such arrays and Latin hypercubes, the proposed method produces various types of Latin hypercubes including orthogonal and nearly orthogonal Latin hypercubes, sliced Latin hypercube...

متن کامل

Nonfactorizable nonsingular hypercubes

We investigate nonsingular hypercubes, and prove several results, stating a condition for a hypercube to be the product of hypercubes of smaller dimensions. There is a shortage of higher dimensional nonsingular hypercubes in the literature. However, we show that the product of two nonsingular hypercubes is always nonsingular. Then we show how to construct four-dimensional nonsingular hypercubes...

متن کامل

Latin k-hypercubes

We study k dimensional Latin hypercubes of order n. We describe the automorphism groups of the hypercubes and define the parity of a hypercube and relate the parity with the determinant of a permutation hypercube. We determine the parity in the orbits of the automorphism group. Based on this definition of parity we make a conjecture similar to the Alon-Tarsi conjecture. We define an orthogonali...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Australasian J. Combinatorics

دوره 47  شماره 

صفحات  -

تاریخ انتشار 2010